Corrigendum : A Combinatorial Problem in Matching
نویسندگان
چکیده
منابع مشابه
Formulation Schema Matching Problem for Combinatorial Optimization Problem
Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the schema matching problem (SMP) into a multi-labeled graph matching problem. First, we propose an internal schema model: multi-labeled graph model, and transform schemas into multi-labeled graphs. Therefore, SMP reduce to...
متن کاملGraph matching as a combinatorial optimization problem with constraints
Let us introduce some notations. We will call GM = (VM , EM ) the model graph and GD = (VD, ED) the data graph which contains the image segments that have to be matched against GM , where Vi is the set of vertices and Ei is the set of edges of graph Gi (i = M,D). In inexact graph matching problems GD is assumed to contain more segments than GM , as that is the case when generated from an over-s...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملmatching interdiction problem in dendrimers
the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...
متن کاملA combinatorial problem in geometry
© Foundation Compositio Mathematica, 1935, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 1969
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-1.1.398-s